Near Threshold Graphs
نویسنده
چکیده
A conjecture of Grone and Merris states that for any graph G, its Laplacian spectrum, Λ(G), is majorized by its conjugate degree sequence, D∗(G). That conjecture prompts an investigation of the relationship between Λ(G) and D∗(G), and Merris has characterized the graphs G for which the multisets Λ(G) and D∗(G) are equal. In this paper, we provide a constructive characterization of the graphs G for which Λ(G) and D∗(G) share all but two elements.
منابع مشابه
Spanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملProtean Graphs
We propose a new random model of web graphs in which the degree of a vertex depends on its age. We characterize the degree sequence of this model and study its behaviour near the connectivity threshold.
متن کاملThreshold-Coloring and Unit-Cube Contact Representation of Graphs
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is present and pairs of vertices with far colors imply the edge is absent. Not all planar graphs are threshold-colorable, but several subclasses, such as trees...
متن کاملOn the mixing time of geographical threshold graphs
We study the mixing time of random graphs in the d-dimensional toric unit cube [0, 1] generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights, drawn from s...
متن کاملWhen Does the Zero - One Law Hold ? Tomasz Luczak And
In 1960 Paul Erdos and Alfred Renyi [ER] began the subject of random graphs. The 1985 book of Bela Bollobas [B) provides the standard reference for this field. In modern terminology the random graph G(n, p) is a graph on vertex set [n] = {I, ... , n} where each pair i, j of vertices are adjacent with independent probability p. More accurately, G(n, p) is a probability space over the space of gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009